Gestural Text Entry Using Huffman Codes
نویسندگان
چکیده
The H4 technique facilitates text entry with key sequences created using Huffman coding. This study evaluates the use of touch and motion-sensing gestures for H4 input. Touch input yielded better entry speeds (6.6 wpm, versus 5.3 wpm with motion-sensing) and more favourable participant feedback. Accuracy metrics did not differ significantly between the two conditions. Changes to the H4 technique are proposed and the associated benefits and drawbacks are presented.
منابع مشابه
Combining word prediction and r-ary Huffman coding for text entry
Two approaches to reducing effort in switch-based text entry for augmentative and alternative communication devices are word prediction and efficient coding schemes, such as Huffman. However, character distributions that inform the latter have never accounted for the use of the former. In this paper, we provide the first combination of Huffman codes and word prediction, using both trigram and l...
متن کاملEye on the Message: Reducing Attention Demand for Touch-based Text Entry
A touch-based text entry method was developed with the goal of reducing the attention demand on the user. The method, called H4touch, supports the entry of about 75 symbols and commands using only four soft keys. Each key is about 20 larger than the keys on a Qwerty soft keyboard on the same device. Symbols are entered as Huffman codes with most letters requiring just two or three taps. The co...
متن کاملMotionInput: Gestural Text Entry in the Air
Gestural keyboards have become a popular alternative to character-by-character entry on touch screen devices today. The obvious limitation to text entry via a touch screen though is that it is fixed to the device. For this project, we aimed to examine methodologies to input text with hand gestures in the air. This paper outlines a means to extend the implementation of gestural text entry on a t...
متن کاملAn efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...
متن کاملA Reverse-Huffman Algorithm for Text Entry Interface Evaluation
Scanning or soft keyboards display symbols to be selected when highlighted in an order. People with disabilities use these interfaces to compose text by using one or two input actions. We present a reverseHuffman algorithm (RHA) that extracts a representative latent probability distribution from a soft keyboard design and evaluates and compares it with other designs using the Jensen-Shannon Div...
متن کامل